High-Dimensional Data Cubes

This paper introduces an approach to supporting high-dimensional data cubes at interactive query speeds and moderate storage cost. The is based on binary(-domain) that are judiciously partially materialized; the missing information can be quickly reconstructed using statistical or linear programming techniques. enables new applications such as exploratory analysis for feature engineering other fields of science. Moreover, it removes need compromise when building a cube - all columns we might ever wish use included dimensions. Our also up certain dice, roll-up, drill-down operations with hierarchical dimensions compared traditional cubes.